The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices

In this paper, we determine graphs with the largest spectral radius among all the unicyclic and all the bicyclic graphs with n vertices and k pendant vertices, respectively. © 2005 Elsevier Inc. All rights reserved. AMS classification: 05C50

متن کامل

The Signless Laplacian Spectral Radius for Bicyclic Graphs with k Pendant Vertices

In this paper, we study the signless Laplacian spectral radius of bicyclic graphs with given number of pendant vertices and characterize the extremal graphs.

متن کامل

The (signless) Laplacian spectral radii of c-cyclic graphs with n vertices and k pendant vertices

A connected graph is called a c-cyclic graph if it contains n vertices and n + c − 1 edges. Let C(n, k, c) denote the class of connected c-cyclic graphs with n vertices and k pendant vertices. Recently, the unique extremal graph, which has greatest (respectively, signless) Laplacian spectral radius, in C(n, k, c) has been determined for 0 ≤ c ≤ 3, k ≥ 1 and n ≥ 2c + k + 1. In this paper, the un...

متن کامل

The spectral radius of tricyclic graphs with n vertices and k pendent vertices

In this paper, we determine graphs with the largest spectral radius among all the tricyclic graphs with n vertices and k pendent vertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50; 05C35

متن کامل

On the spectral radius of bicyclic graphs with n vertices and diameter d

Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. In this paper we determine the graph with the largest spectral radius among all bicyclic graphs with n vertices and diameter d. As an application, we give first three graphs among all bicyclic graphs on n vertices, ordered according to their spectral radii in decreasing order. © 2006 Elsevi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2005

ISSN: 0024-3795

DOI: 10.1016/j.laa.2005.05.022